منابع مشابه
Barbed Bisimulations for Timed Distributed π-calculus
Modelling distributed systems requires notions as locations, communication among the distributed processes, and resource access. To express time constraints for such systems, we have introduced timed distributed π-calculus called tDπ as an extension of the π-calculus with locations, types and timers. Timers define both timeouts for communication channels and timeouts for resources. We define th...
متن کاملSound Bisimulations for Higher-Order Distributed Process Calculus
While distributed systems with transfer of processes have become pervasive, methods for reasoning about their behaviour are underdeveloped. In this paper we propose a bisimulation technique for proving behavioural equivalence of such systems modelled in the higher-order π-calculus with passivation (and restriction). Previous research for this calculus is limited to context bisimulations and nor...
متن کاملProving Distributed Algorithm Correctness using Fault Tolerance Bisimulations
The possibility of partial failure occuring at any stage of computation complicates rigorous formal treatment of distributed algorithms. We propose a methodology for formalising and proving the correctness of distributed algorithms which alleviates this complexity. The methodology uses fault-tolerance bisimulation proof techniques to split the analysis into two phases, that is a failurefree pha...
متن کاملAmortised Bisimulations
We introduce a quantitative concept for bisimulations by integrating the notion of amortisation (cf. [3]). This allows us to make behavioural comparisons between nondeterministic systems that are inherently non-terminating and to analyse the relative long-term costs of deploying them. To this end, we conservatively extend CCS to include a new set of cost-based actions and define a cost-based qu...
متن کاملParametric Bisimulations
In the last several years, a number of effective methods have been developed for reasoning about program equivalence in higher-order imperative languages like ML. Most recently, we proposed relation transition systems (RTSs), which fruitfully synthesize the direct coinductive style of bisimulations with the flexible invariants on local state afforded by Kripke logical relations, and which furth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1989
ISSN: 0004-5411,1557-735X
DOI: 10.1145/76359.76369